Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), Brussels, Belgium, March 27th, 2015

This talk describes a new graph-pattern engine called Jedi.Using a recent simplification of worst-case optimal join al-gorithms due to Ngo et al., Jedi translates join queries intoa series of set intersection and union operations. Such setoperations are ideally suited to modern CPUs that providessingle-instruction, multiple data (SIMD) instructions. Usingthese ideas, we demonstrate that Jedi outperforms special-ized graph engines by over an order of magnitude and rela-tional systems by over two orders of magnitude on standardgraph processing queries over real data.